Compromise values in cooperative game theory

using game theory techniques in self-organizing maps training

شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...

Cooperative aggregate production planning: a game theory approach

Production costs in general, and workforce and inventory costs in particular, constitute a large fraction of the operating costs of many manufacturing plants. We introduce cooperative aggregate production planning as a way to decrease these costs. That is, when production planning of two or more facilities (plants) is integrated, they can interchange workforce and products inventory; thus, thei...

Compromise in Cooperative Game and the Vikor Method

Five approaches in conflict resolution are distinguished, based on cooperativeness and aggressiveness in resolving conflict. Compromise based on cooperativeness is emphasized here as a solution in conflict resolution. Cooperative game theory oriented towards aiding the conflict resolution is considered and the compromise value for TU(transferable utility)-game is presented. The method VIKOR cou...

Transmission cost allocation based on cooperative game theory

Complexity in Cooperative Game Theory

We introduce cooperative games (N, v) with a description polynomial in n, where n is the number of players. In order to study the complexity of cooperative game problems, we assume that a cooperative game v : 2N → Q is given by an oracle returning v (S) for each query S ⊆ N. Finally, we consider several cooperative game problems and we give a list of complexity results.